Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
نویسندگان
چکیده
منابع مشابه
Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly time-varying) subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely, the least mean squares (LMS) and the recursive least squares (RLS) adaptive estimation strategies. For both methods, a detail...
متن کاملAdaptive importance sampling in signal processing
In Bayesian signal processing, all the information about the unknowns of interest is contained in their posterior distributions. The unknowns can be parameters of a model, or a model and its parameters. In many important problems, these distributions are impossible to obtain in analytical form. An alternative is to generate their approximations by Monte Carlo-based methods like Markov chain Mon...
متن کاملOptimal Algorithms for L1-subspace Signal Processing
Abstract We describe ways to define and calculate L1-norm signal subspaces which are less sensitive to outlying data than L2-calculated subspaces. We start with the computation of the L1 maximum-projection principal component of a data matrix containing N signal samples of dimension D. We show that while the general problem is formally NP-hard in asymptotically large N , D, the case of engineer...
متن کاملA Graph Diffusion LMS Strategy for Adaptive Graph Signal Processing
Graph signal processing allows the generalization of DSP concepts to the graph domain. However, most works assume graph signals that are static with respect to time, which is a limitation even in comparison to classical DSP formulations where signals are generally sequences that evolve over time. Several earlier works on adaptive networks have addressed problems involving streaming data over gr...
متن کاملEfficacy of Adaptive Signal Processing Algorithms
A method for theoretically comparing a class of Adaptive Estimation Algorithms is presented. The method consists in defining for each algorithm in the class a quantity (the efficacy) that is theoretically computable, that depends only on the statistics of the data. The larger the efflcacy the better the algorithm performs. I . INTRODUCTION In the last years many works in the area of adaptive si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2018
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2018.2835384